Enumeration of Decomposable Combinatorial Structures with Restricted Patterns
نویسندگان
چکیده
منابع مشابه
Mappings On Decomposable Combinatorial Structures: Analytic Approach
Combinatorics, Probability & Computing / Volume 11 / Issue 01 / January 2002, pp 61 78 DOI: 10.1017/S0963548301005016, Published online: 14 February 2002 Link to this article: http://journals.cambridge.org/abstract_S0963548301005016 How to cite this article: E. MANSTAVICIUS (2002). Mappings on Decomposable Combinatorial Structures: Analytic Approach. Combinatorics, Probability & Computing, 11, ...
متن کاملOrder Statistics for Decomposable Combinatorial Structures
In this paper we consider the component structure of decomposable combinatorial objects, both labeled and unlabeled, from a probabilistic point of view. In both cases we show that when the generating function for the components of a structure is a logarithmic function, then the joint distribution of the normalized order statistics of the component sizes of a random object of size n converges to...
متن کاملCombinatorial enumeration of 2×2 ribbon patterns
An algorithm for creating repeating patterns from a single decorated square gives rise to an obvious combinatorial question: How many different patterns can be created, following the rules? Answers vary according to the definition of equivalence of patterns, and computer sorting programs can provide numerical answers. But algebraic techniques give insight into the answers and provide general fo...
متن کاملOn Poisson-Dirichlet limits for random decomposable combinatorial structures
We prove a joint local limit law for the distribution of the r largest components of decomposable logarithmic combinatorial structures, including assemblies, multisets and selections. Our method is entirely probabilistic, and requires only weak conditions that may readily be verified in practice. Combinatorics, Probability and Computing (1999) 8, 193–208. Printed in the United Kingdom c © 1999 ...
متن کاملThe Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern
In our previous work (2), we derived an asymptotic expression for the probability that a random de-composable combinatorial structure of size n in the exp-log class has a given restricted pattern. In this paper, under similar conditions, we provide the probability that a random decomposable combinatorial structure has a given restricted pattern and the size of its rth smallest component is bigg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2009
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-009-0008-y